© IJCSI PUBLICATION 2011 www.IJCSI.org IJCSI Publicity Board 2011

نویسندگان

  • Borislav D Dimitrov
  • Vishal Goyal
  • Tristan Vanrullen
  • Karim Mohammed Rezaul
  • Gitesh K. Raikundalia
  • Dalbir Singh
  • Prabhat K. Mahanti
  • Panagiotis Michailidis
  • Saqib Rasool Chaudhry
  • Shishir Kumar
  • Shaveta Rani
چکیده

One of the advantages of the Discrete Wavelet Transform (DWT) compared to Fourier Transform (e.g. Discrete Cosine Transform DCT) is its ability to provide both spatial and frequency localization of image energy. However, WT coefficients, like DCT coefficients, are defined by magnitude as well as sign. While algorithms exist for the coding of wavelet coefficients magnitude, there are no efficient for coding their sign. In this paper, we propose a new method based on separate entropy coding of sign and magnitude of wavelet coefficients. The proposed method is applied to the standard color test images Lena, Peppers, and Mandrill. We have shown that sign information of wavelet coefficients as well for the luminance as for the chrominance, and the refinement information of the quantized wavelet coefficients may not be encoded by an estimated probability of 0.5. The proposed method is evaluated; the results obtained are compared to JPEG2000 and SPIHT codec. We have shown that the proposed method has significantly outperformed the JPEG2000 and SPIHT codec as well in terms of PSNR as in subjective quality. We have proved, by an original mathematical analysis of the entropy, that the proposed method uses a minimum bit allocation in the sign

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IJCSI Publicity Board 2011

This paper presents a high-performance method for the k-nearest neighbourhood search. Starting from a point cloud, first the method carries out the space division by the typical cubic grid partition of the bounding box; then a new data structure is constructed. Based on these two previous steps, an efficient implementation of the k-nearest neighbourhood is proposed. The performance of the metho...

متن کامل

IJCSI Publicity Board 2010

Grid Com puting is a p latform f or coord inated r esource sharing and problem solving on a global scale among vir tual organizations. Grid uses Grid Services to access and use a set of Grid resources. Subsequently, these Grid Ser vices need to be discov ered, selected and invoked quickly and efficiently to s atisfy the needs of a demanding environment such as Grid. In this pap er, we introd uc...

متن کامل

© Ijcsi Publication 2011

The classification of digital documents is a complex task in a document analysis flow. The amount of documents resulting from the OCR retro-conversion (optical character recognition) makes the classification task harder. In the literature, different features are used to improve the classification quality. In this paper, we evaluate various features on OCRed and non OCRed documents. Thanks to th...

متن کامل

An Efficient Approach for Test Suite Reduction using Density based Clustering Technique

Lilly Rameesh and G. V. Uma, "Reliable Mining of Automatically Generated Test Cases", IJCSI International Journal of Computer Science Issues, Volume 7, Issue 1, January 2010. Lilly Rameesh and G. V. Uma, "An Efficient Reduction Method For Test Cases", International Journal of Engineering Science and Technology, Volume 2, Issue 11, January 2010. Kartheek Muthyala et. al. , &q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011